The Regular Viewpoint on PA - Pro esses

نویسنده

  • D. Lugiez
چکیده

To appear in Theoretical Computer Science The Regular Viewpoint on PA-Pro esses D. Lugiez Lab. d'Informatique de Marseille, Univ. Aix-Marseille & CNRS URA 1787, 39, r. Joliot-Curie, 13453 Marseille Cedex 13, FRANCE and Ph. S hnoebelen Lab. Spe i ation and Veri ation, ENS de Ca han & CNRS UMR 8643, 61 av. Pdt Wilson, 94235 Ca han Cedex, FRANCE Abstra t PA is the pro ess algebra allowing non-determinism, sequential and parallel ompositions, and re ursion. We suggest viewing PA-pro esses as trees, and using treeautomata te hniques for veri ation problems on PA. Our main result is that the set of iterated prede essors of a regular set of PApro esses is a regular tree language, and similarly for iterated su essors. Furthermore, the orresponding tree-automata an be built e e tively in polynomial-time. This has many immediate appli ations to veri ation problems for PA-pro esses, among whi h a simple and general modelhe king algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Regular Viewpoint on Pa−processes the Regular Viewpoint on Pa-processes

PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PA-processes as tree languages. Our main result is that the set of iterated predecessors of a regular set of PA-processes is a regular tree language, and similarly for iterated successors. Furthermore, the corresponding tree-automata can be built eeectively in polynomial...

متن کامل

The Regular Viewpoint on PA-Processes

PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PAprocesses as tree languages. Our main result is that the set of (iterated) predecessors of a regular set of PA-processes is a regular tree language, and similarly for (iterated) successors. Furthermore, the corresponding tree-automata can be built e ectively in polynom...

متن کامل

Numeri al Analysis of Queues with Bat h Arrivals

The steady state distribution of quasi-birth-death pro esses an be eÆ iently obtained by matrix-geometri (MG) methods. Sin e a number of tele ommuni ation problems are modelled by pro esses with bat h arrivals, the extension of MG methods for these pro esses has pra ti al importan e. This paper presents an extension of MG methods whi h is e e tive for the analysis of quasi-birth-death pro esses...

متن کامل

Analysis of Queues with Bat h Arrivals

The steady state distribution of quasi-birth-death pro esses an be eÆ iently obtained by matrix-geometri (MG) methods. Sin e a number of tele ommuni ation problems are modelled by pro esses with bat h arrivals, the extension of MG methods for these pro esses has pra ti al importan e. This paper presents an extension of MG methods whi h is e e tive for the analysis of quasi-birth-death pro esses...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999